Computing the Matrix Exponential with an Optimized Taylor Polynomial Approximation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Scaling-Squaring Taylor Algorithms for Computing the Matrix Exponential

The matrix exponential plays a fundamental role in linear differential equations arising in engineering, mechanics, and control theory. The most widely used, and the most generally efficient, technique for calculating the matrix exponential is a combination of “scaling and squaring” with a Padé approximation. For alternative scaling and squaring methods based on Taylor series, we present two mo...

متن کامل

Efficient Scaling-squaring Taylor Method for Computing the Matrix Exponential∗

The matrix exponential plays a fundamental role in linear systems arising in engineering, mechanics and control theory. In this paper, an efficient Taylor method for computing matrix exponentials is presented. Taylor series truncation together with a modification of the PatersonStockmeyer method avoiding factorial evaluations, and the scaling-squaring technique, allow efficient computation of t...

متن کامل

Computing the Action of the Matrix Exponential, with an Application to Exponential Integrators

A new algorithm is developed for computing etAB, where A is an n× n matrix and B is n×n0 with n0 ≪ n. The algorithm works for any A, its computational cost is dominated by the formation of products of A with n× n0 matrices, and the only input parameter is a backward error tolerance. The algorithm can return a single matrix etAB or a sequence etkAB on an equally spaced grid of points tk. It uses...

متن کامل

Orthogonal polynomial expansions for the matrix exponential

Many different algorithms have been suggested for computing the matrix exponential. In this paper, we put forward the idea of expanding in either Chebyshev, Legendre or Laguerre orthogonal polynomials. In order for these expansions to converge quickly, we cluster the eigenvalues into diagonal blocks and accelerate using shifting and scaling.

متن کامل

The Matrix Unwinding Function, with an Application to Computing the Matrix Exponential

A new matrix function corresponding to the scalar unwinding number of Corless, Hare, and Jeffrey is introduced. This matrix unwinding function, U , is shown to be a valuable tool for deriving identities involving the matrix logarithm and fractional matrix powers, revealing, for example, the precise relation between logAα and α logA. The unwinding function is also shown to be closely connected w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2019

ISSN: 2227-7390

DOI: 10.3390/math7121174